Semester Report
نویسنده
چکیده
This is best possible in the sense that we cannot additionally require the entire bipartite subgraph of G between S and T to have large minimum degree. Applying the result of Mader that every graph of sufficiently large average degree contains a subdivision of a given graph H to the graph G[S] obtained by the above theorem, it immediately follows that every highly connected graph G contains a “non-separating” subdivision of H:
منابع مشابه
Intelligent Behavior for Computer Game Characters Using Prediction and Learning
This report details the work done and knowledge learned during the first semester of the author’s thesis (CS 297). Although video game graphics has improved tremendously, artificial intelligence in games has taken a much smaller step forward. One of the most promising new prospects in game AI is for the computer to learn and adapt to the environment, and in particular to the player. The thesis ...
متن کاملTeaching a Research-Oriented Visualization Course
This paper describes how a one-semester advanced-level course can be designed so that the students conduct original research in graphics and visualization. The course aims to produce papers that are acceptable at a peer-reviewed technical conference. I describe my experience teaching such a course in the spring semester of 1996. This report is intended to encourage others who wish to undertake ...
متن کامل2011 Senior Thesis Project Reports Place Recognition for Indoor Blind Navigation Contents
This technical report collects the final reports of the undergraduate Computer Science majors from the Qatar Campus of Carnegie Mellon University who elected to complete a senior research thesis in the academic year 2010–11 as part of their degree. These projects have spanned the students’ entire senior year, during which they have worked closely with their faculty advisors to plan and carry ou...
متن کامل